Schelling Coin
Public.icon
This seems to be similar to what MakerDAO has already implemented. If you choose the same number at random, the probability of getting out of prison is 1/8. However, in reality, most people choose 100000, so the probability is even higher.
Why 100000? Because each prisoner believes that the number 100000 is "special," and each prisoner believes that the other believes that 100000 is "special," and this is recursively repeated infinitely--this is an example of "common knowledge."
This mechanism is the mechanism of SchellingCoin. The basic protocol is as follows:
Between even-numbered blocks, all users can submit the hash of the ETH/USD price and their Ethereum address.
Submitting the current price as an oracle validator?
After the block, users can submit the value of the hash they provided in the previous block.
H(N+ADDR) is sent in the first block, N is sent in the second block, both messages are signed/sent by the account of address ADDR, and "correctly sent values" are defined as all values of N for which ADDR is one of the system's authorized participants.
Sort the correctly sent values (if many values are the same, perform secondary sorting with H(N+PREVHASH+ADDR).)
All users who correctly sent values between the 25th and 75th percentiles receive a reward of N tokens (called "schells" here).
This passes tokens to validators who did not deviate between 25-75%.